Reweighted Discriminative Optimization for least-squares problems with point cloud registration

نویسندگان

چکیده

Optimization plays a pivotal role in computer graphics and vision. Learning-based optimization algorithms have emerged as powerful technique for solving problems with robustness accuracy because it learns gradients from data without calculating the Jacobian Hessian matrices. The key aspect of is least-squares method, which formulates general parametrized model unconstrained optimizations makes residual vector approach to zeros approximate solution. method may suffer undesirable local optima many applications, especially point cloud registration, where each element transformation vectors has different impact on registration. In this paper, Reweighted Discriminative (RDO) proposed. By assigning weights components parameter vector, RDO explores component asymmetrical contributions fitting results. are adjusted according characteristics mean square error results over space at per iteration. Theoretical analysis convergence provided, benefits demonstrated tasks 3D registrations multi-views stitching. experimental show that outperforms state-of-the-art registration methods terms perturbations achieves further improvement than non-weighting learning-based optimization.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Reweighted Least Squares ∗

Describes a powerful optimization algorithm which iteratively solves a weighted least squares approximation problem in order to solve an L_p approximation problem. 1 Approximation Methods of approximating one function by another or of approximating measured data by the output of a mathematical or computer model are extraordinarily useful and ubiquitous. In this note, we present a very powerful ...

متن کامل

Improved Iteratively Reweighted Least Squares for Unconstrained

In this paper, we first study q minimization and its associated iterative reweighted algorithm for recovering sparse vectors. Unlike most existing work, we focus on unconstrained q minimization, for which we show a few advantages on noisy measurements and/or approximately sparse vectors. Inspired by the results in [Daubechies et al., Comm. Pure Appl. Math., 63 (2010), pp. 1–38] for constrained ...

متن کامل

A parallel min-cut algorithm using iteratively reweighted least squares targeting at problems with floating-point edge weights

We present a parallel algorithm for the undirected s –t min-cut problem with floatingpoint valued edge weights. Our overarching algorithm uses an iteratively reweighted least squares framework. Specifically, this algorithm generates a sequence of Laplacian linear systems, which are solved in parallel. The iterative nature of our algorithm enables us to trade off solution quality for execution t...

متن کامل

Robust Generalized Total Least Squares Iterative Closest Point Registration

This paper investigates the use of a total least squares approach in a generalization of the iterative closest point (ICP) algorithm for shape registration. A new Generalized Total Least Squares (GTLS) formulation of the minimization process is presented opposed to the traditional Least Squares (LS) technique. Accounting for uncertainty both in the target and in the source models will lead to a...

متن کامل

Iteratively Reweighted Least-Squares solutions for non-linear reconstruction

Consider the problem of recovering some real original data c0 from noisy real measurements: m = Ec0 + b. (1) The M ×N matrix real E represents the linear forward model and b is the vector representing both model mismatch and noise. The original data and the measurements do not necessarily have the same size (i.e. the matrix E can be rectangular). A popular way to define the solution c̃ of this i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neurocomputing

سال: 2021

ISSN: ['0925-2312', '1872-8286']

DOI: https://doi.org/10.1016/j.neucom.2021.08.080